Simultaneously Flippable Edges in Triangulations

نویسندگان

  • Diane L. Souvaine
  • Csaba D. Tóth
  • Andrew Winslow
چکیده

Given a straight-line triangulation T , an edge e in T is flippable if e is adjacent to two triangles that form a convex quadrilateral. A set of edges E in T is simultaneously flippable if each edge is flippable and no two edges are adjacent to a common triangle. Intuitively, an edge is flippable if it may be replaced with the other diagonal of its quadrilateral without creating edge-edge intersections, and a set of edges is simultaneously flippable if they may be all be flipped without interferring with each other. We show that every straight-line triangulation on n vertices contains at least (n− 4)/5 simultaneously flippable edges. This bound is the best possible, and resolves an open problem by Galtier et al. .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Counting Plane Graphs: Flippability and Its Applications

We generalize the notions of flippable and simultaneously flippable edges in a triangulation of a set S of points in the plane to so-called pseudo-simultaneously flippable edges. Such edges are related to the notion of convex decompositions spanned by S. We prove a worst-case tight lower bound for the number of pseudo-simultaneously flippable edges in a triangulation in terms of the number of v...

متن کامل

Flipping Edges in Triangulations of Point Sets, Polygons and Maximal Planar Graphs

A triangulation of a point set Pn is a partitioning of the convex hull Conv (Pn) into a set of triangles with disjoint interiors such that the vertices of these triangles are in Pn, and no element of Pn lies in the interior of any of these triangles. An edge e of a triangulation T is called flippable if it is contained in the boundary of two triangles of T , and the union of these triangles for...

متن کامل

Diagonal Flips in Labelled Planar Triangulations

A classical result of Wagner states that any two (unlabelled) planar triangulations with the same number of vertices can be transformed into each other by a finite sequence of diagonal flips. Recently Komuro gives a linear bound on the maximum number of diagonal flips needed for such a transformation. In this paper we show that any two labelled triangulations can be transformed into each other ...

متن کامل

Flipping in Acyclic and Strongly Connected Graphs

A flippable edge in an acyclic digraph is an edge whose reorientation leaves the graph acyclic. We characterize the spanning trees T of an undirected graph G such that there exists an acyclic orientation of G whose set of flippable edges is T . In particular for every edge e ∈ E(G) we give a linear algorithm returning an acyclic orientation and a spanning tree T containing e such that T is the ...

متن کامل

Edge Flips in Combinatorial Triangulations

Description. In this project, we will investigate a topic that has fascinated geometers for many years: the flip graph of triangulations. Its study dates back to a paper by Wagner from 1936 [5]. Triangulations are planar graphs where every face is a triangle. For the purpose of this project, we will consider abstract unlabeled (i.e. isomorphism classes of) triangulations. Every edge {u, v} in a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011